Dynamics , Emergent Computation , and Evolution in Cellular Automata
نویسندگان
چکیده
A new class of models is developed which provides a tool for analyzing emergent computation in cellular automata (CAs). In particular, CAs that were evolved with a genetic algorithm to perform computational tasks requiring global information processing are analyzed. The models are used to make quantitative predictions of the computational performance, on a given task, of these evolved CAs. The models, and the resulting performance predictions, are based on the (emergent) dynamics of the evolved CAs and thus relate the dynamics of these CAs directly to their emergent computational abilities. Furthermore, the class of models is used to determine quantitatively how and to what extent changes in the emergent dynamics of a CA give rise to changes in its performance. In particular, the di erences between the dynamics of CAs that are related to each other in an evolutionary sense are analyzed this way. This, in turn, contributes to a better understanding of the evolution of emergent computation in CAs. Finally, the class of models itself is investigated more thoroughly. For example, a correctness proof of the models is presented and an expression for scaling the models to larger system sizes is derived. The development, application, and investigation of this class of models thus forms a study of, and provides a better understanding of, the relation among dynamics, emergent computation, and evolution in cellular automata.
منابع مشابه
Co-Evolving Demes of Non-Uniform Cellular Automata for Synchronisation
Emergent computation refers to systems in which global information processing appears as a result of the interactions among many components, each of which may be a system that exhibits an ability for emergent computation at a different level of self-organisation. In this paper, we employ a modification of cellular programming to evolve cellular machines for synchronisation. This allows global c...
متن کاملTarget-Oriented Self-Structuring in Classifying Cellular Automata
Some cellular automata are able to solve classification problems on their initial configuration by building globally visible structures. However, no formal measures exist yet for describing or detecting this behavior in general. The lack of such formal methods often leads to quite observer-dependent discussions of emergent computation. In this paper, we propose the measures of target orientatio...
متن کاملA Genetic Algorithm Discovers Particle-Based Computation in Cellular Automata
How does evolution produce sophisticated emergent computation in systems composed of simple components limited to local interactions? To model such a process, we used a genetic algorithm (GA) to evolve cellular automata to perform a computational task requiring globally-coordinated information processing. On most runs a class of relatively unsophisticated strategies was evolved, but on a subset...
متن کاملEmergent computation in simple model of neural activity
We investigate the dynamics of a network consisting of an array of identical cortical units with nearest neighbor interactions under periodic arousal. Each unit consists of two interconnected populations of neurons tuned to a state in which many nonlinear resonances are available. The network is critically balanced due to short-ranged antisymmetric connections between units. For wide ranges of ...
متن کاملMechanisms of Emergent Computation in Cellular Automata
We introduce a class of embedded-particle models for describing the emergent computational strategies observed in cellular automata (CAs) that were evolved for performing certain computational tasks. The models are evaluated by comparing their estimated performances with the actual performances of the CAs they model. The results show, via a close quantitative agreement, that the embedded-partic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999